To and fro between tableaus and automata for description logics
نویسنده
چکیده
منابع مشابه
Tableaus and Automata for Description Logics
In this paper, we briefly present three different approaches at examining the relation between tableaus and automata, and possibly combining their advantages in the context of testing satisfiability of description logic concepts. The first approach tries to transfer the efficiency of tableaus to automata by performing the automata emptiness test with a tableau algorithm. The second one examines...
متن کاملDiscrete Tableau Algorithms for FSHI
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in fuzzy description logics. In this paper, we present a novel discrete tableau algorithm for a given fuzzy description logic FSHI with general TBoxes, which tries to construct discrete tableaus of FSHI knowledge bases. ...
متن کاملReasoning in Fuzzy Description Logics using Automata
Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...
متن کاملFrom Tableaux to Automata for Description Logics
This paper investigates the relationship between automataand tableau-based inference procedures for Description Logics. To be more precise, we develop an abstract notion of what a tableau-based algorithm is, and then show, on this abstract level, how tableau-based algorithms can be converted into automata-based algorithms. In particular, this allows us to characterize a large class of tableau-b...
متن کاملReasoning in description logics with variables: preliminary results regarding the EL logic
This paper studies the extension of description logics with variables ranging over infinite domains of concept names and role names. As a preliminary work, we consider more specifically the extension of the logic EL with variables and we investigate in this context two reasoning mechanisms, namely compliance (a kind of matching) and pattern containment. The main technical results are derived by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007